An Adaptive Packet Aggregation Algorithm (AAM) for Wireless Networks

Packet aggregation algorithms are used to improve the throughput performance by combining a number of packets into a single transmission unit in order to reduce the overhead associated with each transmission within a packet-based communications network. However, the throughput improvement is also accompanied by a delay increase. The biggest drawback of a significant number of the proposed packet aggregation algorithms is that they tend to only optimize a single metric, i.e. either to maximize throughput or to minimize delay. They do not permit an optimal trade-off between maximizing throughput and minimizing delay. Therefore, these algorithms cannot achieve the optimal network performance for mixed traffic loads containing a number of different types of applications which may have very different network performance requirements. In this thesis an adaptive packet aggregation algorithm called the Adaptive Aggregation Mechanism (AAM) is proposed which achieves an aggregation trade-off in terms of realizing the largest average throughput with the smallest average delay compared to a number of other popular aggregation algorithms under saturation conditions in wireless networks. The AAM algorithm is the first packet aggregation algorithm that employs an adaptive selection window mechanism where the selection window size is adaptively adjusted in order to respond to the varying nature of both the packet size and packet rate. This algorithm is essentially a feedback control system incorporating a hybrid selection strategy for selecting the packets. Simulation results demonstrate that the proposed algorithm can (a) achieve a large number of sub-packets per aggregate packet for a given delay and (b) significantly improve the performance in terms of the aggregation trade-off for different traffic loads. Furthermore, the AAM algorithm is a robust algorithm as it can significantly improve the performance in terms of the average throughput in error-prone wireless networks

Teaching Examples and Pedagogy of Mechanical Manufacture based on the CDIO-Based Teaching Method

AbstractCDIO-based teaching method is a pedagogy which organic integrating teacher's research-based teaching and student's research-based studying together; in-class instructing and outside-class practicing together; textbook explaining and extensive reading together; teacher's guiding and student's self-studying together. It aims at the cultivation of student's engineering practical ability. The cutting principle of multi-diameter shaft is used as example, then CDIO-based teaching method is penetrated into the whole teaching process of Mechanical Manufacture, thus the example organization and teaching content are investigated and improved. Practical teaching experiment proves that the implementation of CDIO-based teaching method reaches good teaching result; a new developing thought and effort direction are advanced

Management of Complicated Urinary Tract Infection

The management of complicated urinary tract infection (UTI) remains a challenge since the coexisted conditions may significantly decrease the successful rate of treatment. In this chapter, the specific conditions including indwelling catheter, urolithiasis, neurogenic bladder, vesicoureteral reflux and pregnancy are listed. In terms of each condition, the potential influence on UTI and management strategy is discussed. Not only is the current evidence reviewed but also we present our experience on management of complicated UTI

Synthesis and evaluation of bisulfate/mesylate-conjugated chlortetracycline with high solubility and bioavailability

The aim of this work is to improve the solubility and bioavailability of chlortetracycline and the function of the immune response. Chlortetracycline bisulfate and chlortetracycline mesylate were successfully synthesized and characterized with several techniques, including spectroscopy, chromatography and mass spectrometry, which demonstrated that the C4-dimethylamino group of chlortetracycline can accept a proton from sulfuric acid and methanesulfonic acid to form the corresponding salts. In addition, chlortetracycline bisulfate and chlortetracycline mesylate were more soluble in water than chlortetracycline hydrochloride, but the antibacterial activity was not enhanced. The influences of chlortetracycline hydrochloride, chlortetracycline bisulfate and chlortetracycline mesylate on chlortetracycline and immunoglobulin concentrations in mouse serum were also investigated. These results suggested that the chlortetracycline bisulfate and chlortetracycline mesylate have good bioavailability and strong immune response and have potential applications in animal breeding and formulation technologies

Performance of WLAN in Downlink MU-MIMO Channel with the Least Cost in Terms of Increased Delay

To improve the performance of IEEE 802.11 wireless local area (WLAN) networks, different frame-aggregation algorithms are proposed by IEEE 802.11n/ac standards to improve the throughput performance of WLANs. However, this improvement will also have a related cost in terms of increasing delay. The traffic load generated by mixed types of applications in current modern networks demands different network performance requirements in terms of maintaining some form of an optimal trade-off between maximizing throughput and minimizing delay. However, the majority of existing researchers have only attempted to optimize either one (to maximize throughput or minimize the delay). Both the performance of throughput and delay can be affected by several factors such as a heterogeneous traffic pattern, target aggregate frame size, channel condition, competing stations, etc. However, under the effect of uncertain conditions of heterogeneous traffic patterns and channel conditions in a network, determining the optimal target aggregate frame size is a significant approach that can be controlled to manage both throughput and delay. The main contribution of this study was to propose an adaptive aggregation algorithm that allows an adaptive optimal trade-off between maximizing system throughput and minimizing system delay in the WLAN downlink MU-MIMO channel. The proposed approach adopted different aggregation policies to adaptively select the optimal aggregation policy that allowed for achieving maximum system throughput by minimizing delay. Both queue delay and transmission delay, which have a significant impact when frame-aggregation algorithms are adopted, were considered. Different test case scenarios were considered such as channel error, traffic pattern, and number of competing stations. Through systemlevel simulation, the performance of the proposed approach was validated over the FIFO aggregation algorithm and earlier adaptive aggregation approaches, which only focused on achieving maximum throughput at the expense of delay. The performance of the proposed approach was evaluated under the effects of heterogenous traffic patterns for VoIP and video traffic applications, channel conditions, and number of STAs for WLAN downlink MU-MIMO channels

PASS-JOIN: A Partition-based Method for Similarity Joins

As an essential operation in data cleaning, the similarity join has attracted considerable attention from the database community. In this paper, we study string similarity joins with edit-distance constraints, which find similar string pairs from two large sets of strings whose edit distance is within a given threshold. Existing algorithms are efficient either for short strings or for long strings, and there is no algorithm that can efficiently and adaptively support both short strings and long strings. To address this problem, we propose a partition-based method called Pass-Join. Pass-Join partitions a string into a set of segments and creates inverted indices for the segments. Then for each string, Pass-Join selects some of its substrings and uses the selected substrings to find candidate pairs using the inverted indices. We devise efficient techniques to select the substrings and prove that our method can minimize the number of selected substrings. We develop novel pruning techniques to efficiently verify the candidate pairs. Experimental results show that our algorithms are efficient for both short strings and long strings, and outperform state-of-the-art methods on real datasets.Comment: VLDB201

Performance of an Adaptive Aggregation Mechanism in a Noisy WLAN Downlink MU-MIMO Channel

This paper investigates an adaptive frame aggregation technique in the medium access control (MAC) layer for the Wireless Local Area Network (WALN) downlink Multi-User–Multiple-In Multiple-Out (MU-MIMO) channel. In tackling the challenges of heterogeneous traffic demand among spatial streams, we proposed a new adaptive aggregation algorithm which has a superior performance over the baseline First-in–First-Out (FIFO) scheme in terms of system throughput performance and channel utilization. However, this earlier work does not consider the effects of wireless channel error. In addressing the limitations of this work, this study contributes an enhanced version of the earlier model considering the effect of channel error. In this approach, a dynamic adaptive aggregation selection scheme is proposed by employing novel criteria for selecting the optimal aggregation policy in WLAN downlink MU-MIMO channel. Two simulation setups are conducted to achieve this approach. The simulation setup in Step 1 performs the dynamic optimal aggregation policy selection strategy as per the channel condition, traffic pattern, and number of stations in the network. Step 2 then performed the optimal wireless frame construction that would be transmitted in the wireless channel in adopting the optimal aggregation policy obtained from Step 1 that maximizes the system performance. The proposed adaptive algorithm not only achieve the optimal system throughput in minimizing wasted space channel time but also provide a good performance under the effects of different channel conditions, different traffic models such as Pareto, Weibull, and fBM, and number of users using the traffic mix of VoIP and video data. Through system-level simulation, our results again show the superior performance of our proposed aggregation mechanism in terms of system throughput performance and space channel time compared to the baseline FIFO aggregation approach

A New Adaptive Frame Aggregation Method for Downlink WLAN MU-MIMO Channels

Accommodating the heterogeneous traffic demand among streams in the downlink MU-MIMO channel is among the challenges that affect the transmission efficiency since users in the channel do not always have the same traffic demand. Consequently, it is feasible to adjust the frame size to maximize the system throughput. The existing adaptive aggregation solutions do not consider the effects of different traffic scenarios and they use a Poison traffic model which is inadequate to represent the real network traffic scenarios, thus leading to suboptimal solutions. In this study, we propose some adaptive aggregation strategies which employ a novel dynamic adaptive aggregation policy selection algorithm in addressing the challenges of heterogenous traffic demand in the downlink MU-MIMO channel. Different traffic models are proposed to emulate real world traffic scenarios in the network and to analyze the proposed aggregation polices with respect to various traffic models. Finally, through simulation, we demonstrate the performance of our adaptive algorithm over the baseline FIFO aggregation approach in terms of system throughput performance and channel utilization in achieving the optimal frame size of the system

An Ensemble Learning Approach to Reverse-Engineering Transcriptional Regulatory Networks from Time-Series Gene Expression Data

Background One of the most challenging tasks in the post-genomic era is to reconstruct the transcriptional regulatory networks. The goal is to reveal, for each gene that responds to a certain biological event, which transcription factors affect its expression, and how a set of transcription factors coordinate to accomplish temporal and spatial specific regulations. Results Here we propose a supervised machine learning approach to address these questions. We focus our study on the gene transcriptional regulation of the cell cycle in the budding yeast, thanks to the large amount of data available and relatively well-understood biology, although the main ideas of our method can be applied to other data as well. Our method starts with building an ensemble of decision trees for each microarray data to capture the association between the expression levels of yeast genes and the binding of transcription factors to gene promoter regions, as determined by chromatin immunoprecipitation microarray (ChIP-chip) experiment. Cross-validation experiments show that the method is more accurate and reliable than the naive decision tree algorithm and several other ensemble learning methods. From the decision tree ensembles, we extract logical rules that explain how a set of transcription factors act in concert to regulate the expression of their targets. We further compute a profile for each rule to show its regulation strengths at different time points. We also propose a spline interpolation method to integrate the rule profiles learned from several time series expression data sets that measure the same biological process. We then combine these rule profiles to build a transcriptional regulatory network for the yeast cell cycle. Compared to the results in the literature, our method correctly identifies all major known yeast cell cycle transcription factors, and assigns them into appropriate cell cycle phases. Our method also identifies many interesting synergetic relationships among these transcription factors, most of which are well known, while many of the rest can also be supported by other evidences. Conclusion The high accuracy of our method indicates that our method is valid and robust. As more gene expression and transcription factor binding data become available, we believe that our method is useful for reconstructing large-scale transcriptional regulatory networks in other species as well

An ensemble learning approach to reverse-engineering transcriptional regulatory networks from time-series gene expression data

Background One of the most challenging tasks in the post-genomic era is to reconstruct the transcriptional regulatory networks. The goal is to reveal, for each gene that responds to a certain biological event, which transcription factors affect its expression, and how a set of transcription factors coordinate to accomplish temporal and spatial specific regulations. Results Here we propose a supervised machine learning approach to address these questions. We focus our study on the gene transcriptional regulation of the cell cycle in the budding yeast, thanks to the large amount of data available and relatively well-understood biology, although the main ideas of our method can be applied to other data as well. Our method starts with building an ensemble of decision trees for each microarray data to capture the association between the expression levels of yeast genes and the binding of transcription factors to gene promoter regions, as determined by chromatin immunoprecipitation microarray (ChIP-chip) experiment. Cross-validation experiments show that the method is more accurate and reliable than the naive decision tree algorithm and several other ensemble learning methods. From the decision tree ensembles, we extract logical rules that explain how a set of transcription factors act in concert to regulate the expression of their targets. We further compute a profile for each rule to show its regulation strengths at different time points. We also propose a spline interpolation method to integrate the rule profiles learned from several time series expression data sets that measure the same biological process. We then combine these rule profiles to build a transcriptional regulatory network for the yeast cell cycle. Compared to the results in the literature, our method correctly identifies all major known yeast cell cycle transcription factors, and assigns them into appropriate cell cycle phases. Our method also identifies many interesting synergetic relationships among these transcription factors, most of which are well known, while many of the rest can also be supported by other evidences. Conclusion The high accuracy of our method indicates that our method is valid and robust. As more gene expression and transcription factor binding data become available, we believe that our method is useful for reconstructing large-scale transcriptional regulatory networks in other species as well